Arbitrary-length Fast Hartley Transform without Multiplications

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to implement the proposed method, followed by the complexity analysis. Being different to other fast Hartley transforms, our algorithm can deal with arbitrary length signals and get high precision. The proposed method is easily implemented by hardware and very suited to a realtime processing.